Recording How%2DProvenance on Probabilistic Databases.

Efficient SLCA Computing Service for XML Filtering in IaaS.

Open user schema guided evaluation of streaming RDF queries.

Towards bipartite graph data management.

Identifying Community Structures in Networks with Seed Expansion.

On t%2DCloseness with KL%2DDivergence and Semantic Privacy.

Distributed SLCA%2DBased XML Keyword Search by Map%2DReduce.

FVC A Feature%2DVector%2DBased Classification for XML Dissemination.

GRAMS3 An Efficient Framework for XML Structural Similarity Search.

Automatic filtering algorithm for imbalanced classification.

Learning to rank only using training data from related domain.

XML Structural Similarity Search Using MapReduce.



Semi%2Dsupervised Learning from Only Positive and Unlabeled Data Using Entropy.

A Data Mining Approach to XML Dissemination.

Mining non%2Dredundant diverse patterns an information theoretic perspective.

Financial information processing and development of emerging financial markets.

Financial information processing and development of emerging financial markets.

Managing the Replaceability of Web Services Using Underlying Semantics.

Efficiently Clustering Probabilistic Data Streams.

Detecting Abnormal Trend Evolution over Multiple Data Streams.

An Improved Algorithm for Mining Non%2DRedundant Interacting Feature Subsets.

Directly Identify Unexpected Instances in the Test Set by Entropy Maximization.



Mining Entropy l%2DDiversity Patterns.

Hash%2DSearch An Efficient SLCA%2DBased Keyword Search Algorithm on XML Documents.

TRUSTER TRajectory Data Processing on ClUSTERs.

A Data Accessing Method in Distributed Massive Computing.

Efficient Indices Using Graph Partitioning in RDF Triple Stores.

Tracking High Quality Clusters over Uncertain Data Streams.

Knowledge Discovery from Academic Search Engine.

Towards optimal workload%2Daware XML to relational schema mapping.

Multi%2Ddimensional data density estimation in P2P networks.

Discovering semantic associations among Web services based on the qualitative probabilistic network.

Financial information processing.
This paper models firms&#039; choices between alternative means of presenting information, and the e#ects of di#erent presentations on market prices when investors have limited attention and processing power. In a market equilibrium with partially attentive investors, we examine the e#ects of alternative: levels of discretion in pro forma earnings disclosure, methods of accounting for employee option compensation, and degrees of aggregation in reporting.
An efficient peer%2Dto%2Dpeer indexing tree structure for multidimensional data.

A distributed approach to enabling privacy%2Dpreserving model%2Dbased classifier training.

Detecting Overlapping Community Structures in Networks.

Feature Selection Based on a New Dependency Measure.

Detecting Overlapping Community Structures in Networks with Global Partition and Local Expansion.

Feature Selection Based on a New Dependency Measure.

COSTA Adaptive Indexing for Terms in a Large%2Dscale Distributed System.

SMART A System for Online Monitoring Large Volumes of Network Traffic.

Continuous Content%2DBased Copy Detection over Streaming Videos.

A Fast Method to Find Solution for Service Composition.

DISG A DIStributed Graph Repository for Web Infrastructure %28Invited Paper%29.

Personalized News Video Recommendation Via Interactive Exploration.

Knowledge Mining and Visualization on News Webpages and Large%2DScale News Video Database.

SIMP Efficient XML Structural Index for Multiple Query Processing.

Efficiently querying rdf data in triple stores.

Introduction to the special section on peer%2Dto%2Dpeer computing and web data management.

Using Wide Table to manage web data a survey.

Tracking clusters in evolving data streams over sliding windows.
Tracking clusters in evolving data streams over sliding windows
Divide
The APU Floating-Point Unit comprises execution units, a register file, bus interface and all the control logic necessary to manage the execution of floating-point instructions. Figure 1 provides an overview of the Floating-Point Unit (FPU) architecture.
Proceedings of the ACM SIGMOD International Conference on Management of Data

LINP Supporting Similarity Search in Unstructured Peer%2Dto%2DPeer Networks.


GChord Indexing for Multi%2DAttribute Query in P2P System with Low Maintenance Cost.
Abstract. To provide complex query processing in peer-to-peer systems has attracted much attention in both academic and industrial community. We present GChord, a scalable technique for evaluating queries with multi-attributes. Both exact match and range queries can be handled by GChord. It has advantages over existing methods in that each tuple only needs to be indexed once, while the query efficiency is guaranteed. Thus, index maintenance cost and search efficiency are balanced. Additional optimization techniques further improves the performance of GChord. Extensive experiments are conducted to validate the efficiency of the proposed method. 1
AB%2DIndex An Efficient Adaptive Index for Branching XML Queries.


SDI a swift tree structure for multi%2Ddimensional data indexing in peer%2Dto%2Dpeer networks.
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and remains to be a challenge. In this paper, SDI, a new succinct multi-dimensional balanced tree structure based on peer-to-peer technology, is presented. With SDI structure, the query efficiency can be bounded by O(log N). Compared with previous tree-based methods, SDI has extremely low maintenance cost. This is due to the carefully chosen finger links. Furthermore, new algorithms are designed for both point query and range query processing, which make SDI free from the root-bottleneck problem. Experimental results validate the efficiency and effectiveness of the proposed approach.
Efficient Service Data Management in Dynamic Environment.

SDI a swift tree structure for multi%2Ddimensional data indexing in peer%2Dto%2Dpeer networks.
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and remains to be a challenge. In this paper, SDI, a new succinct multi-dimensional balanced tree structure based on peer-to-peer technology, is presented. With SDI structure, the query efficiency can be bounded by O(log N). Compared with previous tree-based methods, SDI has extremely low maintenance cost. This is due to the carefully chosen finger links. Furthermore, new algorithms are designed for both point query and range query processing, which make SDI free from the root-bottleneck problem. Experimental results validate the efficiency and effectiveness of the proposed approach.
MQX multi%2Dquery engine for compressed XML data.

Sonnet an efficient distributed content%2Dbased dissemination broker.

Academic web search engine generating a survey automatically.

SONNET subscription using path queries over structured overlay networks.

Adaptive scheduling for shared window joins over data streams.

VsLattice A vector%2Dbased conceptual index structure for web service retrieval.

An adaptive and dynamic dimensionality reduction method for high%2Ddimensional indexing.

Approximate Top%2Dk Structural Similarity Search over XML Documents.

Efficient Evaluation of Distance Predicates in XPath Full%2DText Query.

An Efficient Co%2Doperative Framework for Multi%2Dquery Processing over Compressed XML Data.
Abstract. XML is a de-facto standard for exchanging and presenting information on the Web. However, XML data is also recognized as verbose since it heavily inflates the size of the data due to the repeated tags and structures. The data verbosity problem gives rise to many challenges of conventional distributed database technologies. In this paper, we study the XML dissemination problem over the Internet, where the speed of information delivery can be rather slow in a server-client architecture which consists of a large number of geographically spanned users who access a large amount of correlated XML information. The problem becomes more severe when the users access closely related XML fragments, and in this case the usage of bandwidth is inefficient. In order to save bandwidth and process the queries efficiently, we propose an architecture that incorporates XML compression techniques and exploits the results of XPath containment. Within our framework, we demonstrate that the loading of the server is reduced, the network bandwidth can be more efficiently used and, consequently, all clients as a whole can benefit due to savings of various costs. 1
PMJoin Optimizing Distributed Multi%2Dway Stream Joins by Stream Partitioning.
Abstract. In emerging data stream applications, data sources are typically distributed. Evaluating multi-join queries over streams from different sources may incur large communication cost. As queries run continuously, the precious bandwidths would be aggressively consumed without careful optimization of operator ordering and placement. In this paper, we focus on the optimization of continuous multi-join queries over distributed streams. We observe that by partitioning streams into substreams we can significantly reduce the communication cost and hence propose a novel partitionbased join scheme- PMJoin. A few partitioning techniques are studied. To generate the query plan for each substream, a heuristic algorithm is proposed based on a rate-based model. Results from an extensive experimental study show that our techniques can sufficiently reduce the communication cost. 1
KEYNOTE Keyword Search by Node Selection for Text Retrieval on DHT%2DBased P2P Networks.

SIPPER Selecting Informative Peers in Structured P2P Environment for Content%2DBased Retrieval.

VBI%2DTree A Peer%2Dto%2DPeer Framework for Supporting Multi%2DDimensional Indexing Schemes.
Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peerto-Peer systems. In this paper, we propose a new Peer-to-Peer framework based on a balanced tree structure overlay, which can support extensible centralized mapping methods and query processing based on a variety of multidimensional tree structures, including R-Tree, X-Tree, SS-Tree, and M-Tree. Specifically, in a network with N nodes, our framework guarantees that point queries and range queries can be answered within O(logN) hops. We also provide an effective load balancing strategy to allow nodes to balance their work load efficiently. An experimental assessment validates the practicality of our proposal. 1.
Approximately Processing Multi%2Dgranularity Aggregate Queries over Data Streams.

Density%2DBased Clustering over an Evolving Data Stream with Noise.
Clustering is an important task in mining evolving data streams. Beside the limited memory and one-pass constraints, the nature of evolving data streams implies the following requirements for stream clustering: no assumption on the number of clusters, discovery of clusters with arbitrary shape and ability to handle outliers. While a lot of clustering algorithms for data streams have been proposed, they offer no solution to the combination of these requirements. In this paper, we present DenStream, a new approach for discovering clusters in an evolving data stream. The “dense ” micro-cluster (named core-micro-cluster) is introduced to summarize the clusters with arbitrary shape, while the potential core-micro-cluster and outlier micro-cluster structures are proposed to maintain and distinguish the potential clusters and outliers. A novel pruning strategy is designed based on these concepts, which guarantees the precision of the weights of the micro-clusters with limited memory. Our performance study over a number of real and synthetic data sets demonstrates the effectiveness and efficiency of our method.
Scalable Clustering Using Graphics Processors.

ShanghaiGrid an Information Service Grid.

Indexing Fast Moving Objects for kNN Queries Based on Nearest Landmarks.

A false negative approach to mining frequent itemsets from high speed transactional data streams.

Efficient Computation of k%2DMedians over Data Streams Under Memory Constraints.

QoS%2DAware Composite Services Retrieval.

Finding centric local outliers in categorical%2Fnumerical spaces.

Adaptive Probabilistic Search Over Unstructured Peer%2Dto%2DPeer Computing Systems.

ShanghaiGrid A Grid Prototype for Metropolis Information Services.

Distinct Estimate of Set Expressions over Sliding Windows.

A Framework of Web Service Composition for Distributed XML Query Evaluation.

Modeling Web Services Based on the Bayesian Network.

Optimizing continuous multijoin queries over distributed streams.

Management and Retrieval of Web Services Based on Formal Concept Analysis.

Towards Efficient Ranked Query Processing in Peer%2Dto%2DPeer Networks.

P%2DTerse A Peer%2Dto%2DPeer Based Text Retrieval and Search System.

Concept%2DBased Retrieval of Alternate Web Services.

WSQuery XQuery for Web Services Integration.

False%2DNegative Frequent Items Mining from Data Streams with Bursting.

Adaptively Detecting Aggregation Bursts in Data Streams.
Abstract. Finding bursts in data streams is attracting much attention in research community due to its broad applications. Existing burst detection methods suffer the problems that 1) the parameters of window size and absolute burst threshold, which are hard to be determined a priori, should be given in advance. 2) Only one side bursts, i.e. either increasing or decreasing bursts, can be detected. 3) Bumps, which are changes of aggregation data caused by noises, are often reported as bursts. The disturbance of bumps causes much effort in subsequent exploration of mining results. In this paper, a general burst model is introduced for overcoming above three problems. We develop an efficient algorithm for detecting adaptive aggregation bursts in a data stream given a burst ratio. With the help of a novel inverted histogram, the statistical summary is compressed to be fit in limited main memory, so that bursts on windows of any length can be detected accurately and efficiently on-line. Theoretical analysis show the space and time complexity bound of this method is relatively good, while experimental results depict the applicability and efficiency of our algorithm in different application settings.
CoCache Query Processing Based on Collaborative Caching in P2P Systems.

ShanghaiGrid as An Information Service Grid An Overview.

Supporting Ranked Join in Peer%2Dto%2DPeer Networks.

Efficient Web Service Composition Based on Syntactical Matching.

Bloom Filter%2Dbased XML Packets Filtering for Millions of Path Queries.
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to
ShanghaiGrid as An Information Service Grid An Overview.

Supporting Multi%2DDimensional Range Queries in Peer%2Dto%2DPeer Systems.
... well with range queries on multi-dimensional data. To extend existing P2P systems and thus support multidimensional range queries, one needs to consider such issues as space partitioning and mapping, efficient query processing, and load balancing. In this paper, we describe our scheme called ZNet, which addresses all these issues. Moreover, we conduct an extensive performance study which evaluates ZNet against several recent proposals, and our results show that ZNet possesses nearly all desirable properties, while others typically fail in one or another.
Filtering Duplicate Items over Distributed Data Streams.

What makes the differences benchmarking XML database implementations.

C.
This overview of C++ presents the key design, programming, and language-technical concepts using examples to give the reader a feel for the language. C++ is a general-purpose programming language with a bias towards systems programming that supports efficient low-level computation, data abstraction, object-oriented programming, and generic programming. +  1 Introduction and Overview  The C++ programming language provides a model of memory and computation that closely matches that of most computers. In addition, it provides powerful and flexible mechanisms for abstraction; that is, language constructs that allow the programmer to introduce and use new types of objects that match the concepts of an application. Thus, C++ supports styles of programming that rely on fairly direct manipulation of hardware resources to deliver a high degree of efficiency plus higher-level styles of programming that rely on user-defined types to provide a model of data and computation that is closer to a huma...
Proceedings of the 5th ACIS International Conference on Software Engineering


Scalable XSLT Evaluation.

Efficient Query Routing for XML Documents Retrieval in Unstructured Peer%2Dto%2DPeer Networks.

Towards Adaptive Probabilistic Search in Unstructured P2P Systems.

A Distributed Ranking Strategy in Peer%2Dto%2DPeer Based Information Retrieval Systems.

PeerSDI A Peer%2Dto%2DPeer Information Dissemination System.


Towards Load Balancing in Peer%2Dto%2DPeer Environment of Web Services.

N%2DSHOQ%28D%29 A Nonmonotonic Extension of Description Logic SHOQ%28D%29.

Adapting the Content Native Space for Load Balanced Indexing.
Abstract. Today, there is an increasing demand to share data with complex data types (e.g., multi-dimensional) over large numbers of data sources. One of the key challenges is sharing these data in a scalable and efficient way. This paper presents the design of ZNet, a P2P network for supporting multi-dimensional data. ZNet directly operates on the native data space, which is partitioned dynamically and mapped to nodes within the network. Particular attention is given to reduce load imbalance among nodes due to skewed data distribution. Results from an extensive simulation study show that ZNet is efficient in routing and processing range queries, and provides good load balancing. 1
E%2DMail Services on Hybrid P2P Networks.

Service Selection in Dynamic Demand%2DDriven Web Services.

False Positive or False Negative Mining Frequent Itemsets from High Speed Transactional Data Streams.

TROS A Novel Model and Its Implementation for XML Data Management.

Capacity Planning for Composite Web Services Using Queueing Network%2DBased Models.

Sequential Classifiers Combination for Text Categorization An Experimental Study.

Mining Frequent Items in Spatio%2Dtemporal Databases.

CC%2DBuddy an adaptive framework for maintaining cache coherency using peers.
In this paper, we propose a framework called CC-Buddy, for maintaining dynamic data coherency in peer-to-peer environment. Working on the basis of peer heterogeneity in data coherency requirement, peers in CC-Buddy cooperate with each other to disseminate the updates by pushing. Simulation results show that our solution not only improves the fidelity in data, but also reduces the workload of servers, therefore achieves high-scalability.
Scalable XSLT Evaluation

Deriving Relation Keys from XML Keys.
Much work on XML data was around storage and querying and did not consider constraints of XML, especially keys. Since constraints have been proposed in many papers for XML, much research work on constraints has been being done. In this paper, we consider an important class of constraints, XML keys, and try to find the relationship between XML keys and relation keys. Given XML data whose semantics are represented in XML keys, we use a simple transformation language to express a transformation from the XML data to a relational database. Then we provide a formal definition of a relation tree that represents a well-formed rule on a relation written in the transformation language. After all rules that make up the transformation have been written, we show the way how XML data is transformed into relations. Finally, we present an algorithm for deriving relation keys from XML keys. These keys should be specified on the transformed relations or their compatibility with the predefined schema should be verified.
Information Acquisition Through an Integrated Paradigm Agent   Peer%2Dto%2DPeer.

Fuzzy Cost Modeling for Peer%2Dto%2DPeer Systems.
Abstract. The objective of query optimizers is to select a good execution plan for a given query. In a distributed system, it is crucial for a query optimizer to have effective remote cost estimation in order to make a satisfactory decision. There are two categories of cost estimation models: static cost model and dynamic cost model. Unfortunately, these models suffer from several limitations. First, the static cost model is not capable of reflecting real-time situations. Second, dynamic cost model is not scalable due to its extensive probe queries. Third, these models are not designed for ad-hoc systems such as P2P, since the dynamism of peers is not taken into consideration. In this paper, we firstly propose a progressive “push-based ” remote cost monitoring approach. We derive a generic static cost model from conventional static approach. Agents will be sent to remote hosts with a generic cost model and epsilons (ε) indicating magnitude of cost change, i.e., percentage of coefficient change. An update will be sent (push) to original host once the magnitude of the cost change exceeds ε. Second, we introduce a fuzzy cost evaluation metric in additional to traditional evaluation criteria for handling the dynamism of P2P systems. This metric gives a confident measurement of a peer’s reliability. Our contributions have successfully addressed some of the issues concerning the cost modeling in environment of dynamic peers. 1
Efficient Evaluation in XML to XML Transformations.

FIXT A Flexible Index for XML Transformation.

Constraint Preserving XML Updating.

Explore the %22Small World Phenomena%22 in Pure P2P Information Sharing Systems.
Instrumenting the physical world through large networks of wireless sensor nodes, particularly for applications like environmental monitoring of water and soil, requires that these nodes be very small, light, untethered and unobtrusive. The problem of localization, i.e., determining where a given node is physically located in a network is a challenging one, and yet extremely crucial for many of these applications. Practical considerations such as the small size, form factor, cost and power constraints of nodes preclude the reliance on GPS (Global Positioning System) on all nodes in these networks. In this paper, we review localization techniques and evaluate the effectiveness of a very simple connectivity-metric method for localization in outdoor environments that makes use of the inherent radio-frequency (RF) communications capabilities of these devices. A fixed number of reference points in the network with overlapping regions of coverage transmit periodic beacon signals. Nodes use a...
Dynamically maintaining frequent items over a data stream.
It is challenge to maintain frequent items over a data stream, with a small bounded memory, in a dynamic environment where both insertion/deletion of items are allowed. In this paper, we propose a new novel algorithm, called hCount, which can handle both insertion and deletion of items with a much less memory space than the best reported algorithm. Our algorithm is also superior in terms of precision, recall and processing time. In addition, our approach does not request the preknowledge on the size of range for a data stream, and can handle range extension dynamically. Given a little modification, algorithm hCount can be improved to hCount*, which even owns significantly better performance than before. 1.
Fast Text Classification A Training%2DCorpus Pruning Based Approac.

M%2DKernel Merging Towards Density Estimation over Data Streams.
Density estimation is a costly operation for computing distribution information of data sets underlying many important data mining applications, such as clustering and biased sampling. However, traditional density estimation methods are inapplicable for streaming data, which are continuous arriving large volume of data, because of their request for linear storage and square size calculation. The shortcoming limits the application of many existing effective algorithms on data streams, for which the mining problem is an emergency for applications and a challenge for research. In this paper, the problem of computing density functions over data streams are examined. A novel method attacking this shortcoming of existing methods is developed to enable density estimation for large volume of data in linear time, fixed size memory, and without lose of accuracy. The method is based on M-Kernel merging, so that limited kernel functions to be maintained are determined intelligently. The application of the new method on different streaming data models are discussed, and the result of intensive experiments is presented. The analytical and empirical result show that this new density estimation algorithm for data streams can calculate density functions on demand at any time with high accuracy for different streaming data models. 1 
Index Selection for Efficient XML Path Expression Processing.

PeerBus A Middleware Framework towards Interoperability among P2P Data Sharing Systems.

C2 A New Overlay Network Based on CAN and Chord.


ShanghaiGrid in Action The First Stage Projects towards Digital City and City Grid.


Dynamic Tuning of XML Storage Schema in VXMLR.

PeerDB A P2P%2Dbased System for Distributed Data Sharing.
In this paper, we present the design and evaluation of PeerDB, a peer-to-peer (P2P) distributed data sharing system. PeerDB distinguishes itself from existing P2P systems in several ways. First, it is a full-fledge data management system that supports fine-grain content-based searching. Second, it facilitates sharing of data without shared schema. Third, it combines the power of mobile agents into P2P systems to perform operations at peers&#039; sites. Fourth, PeerDB network is self-configurable, i.e., a node can dynamically optimize the set of peers that it can communicate directly with based on some optimization criterion. By keeping peers that provide most information or services in close proximity (i.e, direct communication), the network bandwidth can be better utilized and system performance can be optimized. We implemented and evaluated PeerDB on a cluster of 32 Pentium II PCs. Our experimental results show that PeerDB can effectively exploit P2P technologies for distributed data sharing.
What Makes the Differences Benchmarking XML Database Implementations.

An Adaptive and Efficient Dimensionality Reduction Algorithm for High%2DDimensional Indexing.
The notorious “dimensionality curse ” is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to overcoming degradation in performance with respect to increasing dimensions is to reduce the dimensionality of the original dataset before constructing the index. However, identifying the correlation among the dimensions and effectively reducing them is a challenging task. In this paper, we present an adaptive Multi-level Mahalanobisbased Dimensionality Reduction (MMDR) technique for high-dimensional indexing. Our MMDR technique has three notable features compared to existing methods. First, it discovers elliptical clusters using only the low-dimensional subspaces. Second, data points in the different axis systems are indexed using a single B ¤-tree. Third, our technique is highly scalable in terms of data size and dimensionality. An extensive performance study using both real and synthetic datasets was conducted, and the results show that our technique not only achieves higher precision, but also enables queries to be processed efficiently. 1
Dynamic Tuning of XML Storage Schema in VXMLR.

HOT Hypergraph%2DBased Outlier Test for Categorical Data.
As a widely used data mining technique, outlier detection is  a process which aims to find anomalies with good explanations. Most  existing methods are designed for numeric data. However, they will meet  problems in real-life applications, which always contain categorical data.
PeerDB Peering into Personal Databases.

TREX DTD%2DConforming XML to XML Transformations.

Efficient Semantic Search in Peer%2Dto%2DPeer Systems.

Peer%2DServ A Framework of Web Services in Peer%2Dto%2DPeer Environment.

Dynamic Clustering%2DBased Query Answering in Peer%2Dto%2DPeer Systems.
P2P computing has been employing in more and more application domains as the technology becomes mature. One  popular and successful application area is file sharing. However, current file sharing systems support only or mainly keybased  exact matching (e.g., Chord [27], CAN [25]) and keyword-based searching (e.g., Napster, Gnutella) for files discovery  and location, which is not enough to meet the requirements of more advanced applications such as information retrieval  and data management. In this paper, we propose a new query answering model for P2P applications, which is termed as  clustering-based query answering (CBQA). In our definition, CBQA will retrieve the data objects that are in the same cluster  of the query from the global dataset distributed over peers of a P2P system. Generally, CBQA may obtain more correct  answers than similarity based query can, which means higher recall may be achieved. To implement the new query model, we  first present a framework that support clustering based query answering, including general algorithms, lemmas and system  architecture. Then we give three concrete algorithms for different clustering criteria, namely k-nearest-neighbor, distancebased,  and density-based clustering, along with detailed analyses and discussions. Finally, implementation issues, especially  dynamic neighbors selection and caching techniques to enable the scalability of our method are addressed. Theoretical  analysis and preliminary experiments show that our method can guarantee to find desirable objects in the interested cluster  with modest bandwidth overhead.
UD%28k%2C l%29%2DIndex An Efficient Approximate Index for XML Data.

Clustering in Very Large Databases Based on Distance and Density.

Data Management in Peer%2Dto%2DPeer Environment A Perspective of BestPeer.

DVQ Towards Visual Query Processing of XML Database Systems.

BuddyWeb A P2P%2DBased Collaborative Web Caching System.
this paper, we look at yet another application - that of collaborative web caching. Unlike existing web caching techniques that are typically managed at the proxies, we look at how to exploit local caches of nodes (or rather PCs) within an enterprise network
DVQ a DTD%2Ddriven Visual Query Interface for XML Database Systems.

DTD%2DDirected Publishing with Attribute Translation Grammars.
We present a framework for publishing relational  data in XML with respect to a fixed DTD. In data  exchange on the Web, XML views of relational  data are typically required to conform to a predefined  DTD. The presence of recursion in a DTD as  well as non-determinism makes it challenging to  generate DTD-directed, efficient transformations.
An Empirical Study of Learning%2DBased Web Search.
Although there are various approaches to facilitate the information  search on the Web, most current Web search and query systems only return  URLs of relevant pages. Learning-based Web search is invented targeting at  processing the URLs to dig out the desired information by utilizing user feedback.
Structural Map A New Index for Efficient XML Path Expression Processing.

Topic Exploration and Distillation for Web Search by a Similarity%2DBased Analysis.

A Content%2DBased Resource Location Mechanism in PeerIS.
With the flurry of research on P2P computing, many P2P technical challenges have emerged, one of which is how to efficiently locate desired resources. Advances have been made in this hot research field, where the pioneers are Pastry, CAN, Chord, and Tapestry. By using the functionality of distributed hash table, they have achieved fair effectiveness. However, they have many common limitations, such as ignoring the autonomous nature of peers, and just supporting weakly semantic functions. In this paper, according to the reality in the distributed network, we propose a content-based location mechanism, which not only keep the autonomy of peers, but also support approximate query and finer granularity of content sharing. Furthermore, this mechanism also facilitates P2P system to evolve dynamically. We have also used PeerIS, a P2P based information system used to verify it and obtained satisfactory results.
yn n%2Dgram%2Dbased approach for detecting approximately duplicate database records.

A Similarity%2DBased Model for Topic Distillation.

A New Classification Method to Overcome.

Effective Discovery of Exception Class Association Rules.

Clustering DTDs An Interactive Two%2DLevel Approach.

Mobile%2DAgent Based Distributed Web GIS.

A Hybrid Approach to Clustering in Very Large Databases.

VXMLR A Visual XML%2DRelational Database System.

Enhancing XML Data Processing in Relational System with Indices.

Adjacency Matrix Based Full%2DText Indexing Models.

Web%2DAge Information Management

Mobile Agent%2DBased Distributed Geographic Information Systems under Internet Environment.

Combining Sampling Technique with DBSCAN Algorithm for Clustering Large Spatial Databases.

Implementation and Proof for Normalization Design of Object%2DOriented Data Schemes.

Incremental Mining of the Schema of Semistructured Data.

Fast Algorithms of Mining Probability Functional Dependency Rules in Relational Database.

Generalized Multidimensional Association Rules.
With wide applications of computers and automated data collection tools, massive amounts of data have been continuously collected and stored in databases, which creates an imminent need and great opportunities for mining interesting knowledge from data. Association rule mining is one kind of data mining techniques which discovers strong association or correlation relationships among data. The discovered rules may help market basket or cross-sales analysis, decision making, and business management. In this thesis, we propose and develop an interesting association rule mining approach, called on-line analytical mining of association rules, which integrates the recently developed OLAP (on-line analytical processing) technology with some efficient association mining methods. It leads to flexible, multi-dimensional, multi-level association rule mining with high performance. Several algorithms are developed based on this approach for mining various kinds of associations in multi-dimensional ...
Approaches for Scaling DBSCAN Algorithm to Large Spatial Databases.

An Improved Definition of Multidimensional Inter%2Dtransaction Association Rule.

Incremental Mining of Schema for Semistructured Data.

Mining Functional Dependency Rule of Relational Database.

